ar X iv : 0 71 1 . 04 06 v 1 [ m at h . N A ] 2 N ov 2 00 7 GENERALIZED MONOTONE SCHEMES , DISCRETE PATHS OF EXTREMA , AND DISCRETE ENTROPY CONDITIONS
نویسندگان
چکیده
Solutions to conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this property from a numerical standpoint. We introduce a class of fully discrete in space and time, high order accurate, difference schemes, called generalized monotone schemes. Convergence toward the entropy solution is proven via a new technique of proof, assuming that the initial data has a finite number of extremum values only, and the flux-function is strictly convex. We define discrete paths of extrema by tracking local extremum values in the approximate solution. In the course of the analysis we establish the pointwise convergence of the trace of the solution along a path of extremum. As a corollary, we obtain a proof of convergence for a MUSCL-type scheme being second order accurate away from sonic points and extrema. Published as : Math. of Comput. 68 (1998), 1025–1055. 1 Ecole Polytechnique, Palaiseau, France. CURRENT ADDRESS : Laboratoire Jacques-Louis Lions, Centre National de la Recherche Scientifique, Université de Paris 6, 4, Place Jussieu, 75252 Paris, France. E-mail address: LeFloch@ann.jussieu.fr. P.G.L. was supported in parts by the Centre National de la Recherche Scientifique, and by the National Science Foundation under grants DMS-88-06731, DMS 94-01003 and DMS 95-02766, and a Faculty Early Career Development award (CAREER). 2 Temple University, Philadelphia, USA. CURRENT ADDRESS : Department of Mathematics, University of Maryland, College Park, MD 20742-4015, USA. J.G.L. was partially supported by DOE grant DE-FG02 88ER-25053. Mathematics Subject Classification: 35L65, 65M12.
منابع مشابه
ar X iv : 0 81 1 . 04 65 v 1 [ m at h . A P ] 4 N ov 2 00 8 Spurious caustics of Dispersion Relation Preserving schemes
A linear dispersive mechanism leading to a burst in the L∞ norm of the error in numerical simulation of polychromatic solutions is identified. This local error pile-up corresponds to the existence of spurious caustics, which are allowed by the dispersive nature of the numerical error. From the mathematical point of view, spurious caustics are related to extrema of the numerical group velocity a...
متن کاملGeneralized monotone schemes, discrete paths of extrema, and discrete entropy conditions
Solutions of conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this property from a numerical standpoint. We introduce a class of fully discrete in space and time, high order accurate, difference schemes, called generalized monoto...
متن کاملGeneralized Monotone Schemes , Discrete Paths of Extrema , and Discrete Entropy
Solutions of conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this property from a numerical standpoint. We introduce a class of fully discrete in space and time, high order accurate, diierenceschemes, called generalized monotone...
متن کاملSpontaneously Broken Su ( 5 ) Symmetries and One - Loop Effects in the Early Universe ∗
This paper studies one-loop effective potential and spontaneous-symmetrybreaking pattern for SU(5) gauge theory in De Sitter space-time. Curvature effects modify the flat-space effective potential by means of a very complicated special function previously derived in the literature. An algebraic technique already developed by the first author to study spontaneous symmetry breaking of SU(n) for r...
متن کاملOptimal search algorithm for extrema of a discrete periodic bimodal function
Some problems related to applications require an analysis of a function h defined on R and computable on a set S of N discrete points xl, . . . , x~. In many applications, all Xi, i = 1, . . . , N, are easy to compute; however, every evaluation of h is a time-consuming process. A specific example is provided later in the paper. The goal of this paper is to describe an optimal algorithm for sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999